A First-Order Isomorphism Theorem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A First-Order Isomorphism Theorem

We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds. Since \natural" complete problems seem to stay complete via fops, this indicates that up to rst-order isomorphism there is only one \natural" complete problem for each \...

متن کامل

The First-Order Isomorphism Theorem

For any class C und closed under NC reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC) reductions are isomorphic under first-order computable

متن کامل

A definability theorem for first order logic

In this paper, we will present a definability theorem for first order logic. This theorem is very easy to state, and its proof only uses elementary tools. To explain the theorem, let us first observe that if M is a model of a theory T in a language L, then, clearly, any definable subset S ⊂ M (i.e., a subset S = {a | M |= φ(a)} defined by some formula φ) is invariant under all automorphisms of ...

متن کامل

The First Isomorphism Theorem and Other Properties of Rings

Different properties of rings and fields are discussed. We introduce ring homomorphisms, their kernels and images, and prove the First Isomorphism Theorem, namely that for a homomorphism f : R −→ S we have R/ker(f) ∼= Im(f). Then we define prime and irreducible elements and show that every principal ideal domain is factorial. Finally we show that polynomial rings over fields are Euclidean and h...

متن کامل

Proving Isomorphism of First-Order Logic Proof Systems in HOL

We prove in HOL that three proof systems for classical rst-order predicate logic, the Hilbertian axiomatization, the system of natural deduction, and a variant of sequent calculus, are isomorphic. The isomorphism is in the sense that provability of a conclusion from hypotheses in one of these proof systems is equivalent to provability of this conclusion from the same hypotheses in the others. P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 1997

ISSN: 0097-5397,1095-7111

DOI: 10.1137/s0097539794270236